Scaling Limit of Loop Erased Random Walk — a Naive Approach
نویسنده
چکیده
We give an alternative proof of the existence of the scaling limit of loop-erased random walk which does not use Löwner’s differential equation.
منابع مشابه
The scaling limit of loop-erased random walk in three dimensions
Loop-erased random walk is a model for a random simple (i.e. non-selfintersecting) path created by taking a random walk and, whenever it hits itself, deleting the resulting loop and continuing. We will explain why this model is interesting and why scaling limits are interesting, and then go on to describe the proof (that the limit exists), as time will permit.
متن کاملConvergence of loop-erased random walk in the natural parameterization
We prove that loop-erased random walk parametrized by renormalized length converges in the lattice size scaling limit to SLE2 parametrized by Minkowski content.
متن کاملScaling Limits of the Uniform Spanning Tree and Loop-erased Random Walk on Finite Graphs
Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the torus Zn for d ≥ 5. Moreover, on this family of graphs we show that a suitably normalized finite-dimensional scaling limit of the uniform spanning tree is a Brownian continuum random tree.
متن کاملLoop-Erased Random Walk and Poisson Kernel on Planar Graphs
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on Z2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into C so that edges do not cross one another). We show that if the scaling limit of the random walk is planar Brownian motion, then the scaling limit of its loop-erasure is SLE2. Our main co...
متن کاملThe loop - erased random walk and the uniform spanning tree on the four - dimensional discrete torus
Let x and y be points chosen uniformly at random from Z4n, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n(logn), resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on Z4n is the Brownian continuum random tree of Aldous. Our proofs use the techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002